Adaptive Aloha anti-collision algorithms for RFID systems

نویسندگان

  • Feng Zheng
  • Thomas Kaiser
چکیده

In this paper, we propose two adaptive frame size Aloha algorithms, namely adaptive frame size Aloha 1 (AFSA1) and adaptive frame size Aloha 2 (AFSA2), for solving radio frequency identification (RFID) multiple-tag anti-collision problem. In AFSA1 and AFSA2, the frame size in the next frame is adaptively changed according to the real-time collision rate measured in the current frame. It is shown that AFSA1 and AFSA2 can significantly improve the transmission efficiency of RFID systems compared to the static Aloha, and AFSA2 produces transmission efficiency similar to that of the electronic product code (EPC) Q-selection algorithm (Variant II), while the mean identification delay of AFSA2 is much smaller than that of EPC Q-selection algorithm (Variant II). It is also shown that the transmission efficiency of AFSA2 and EPC Variant II is very close to its upper bound which is obtained by assuming that the reader knows the number of unidentified tags. It is worth noting that when the threshold of the collision rate is chosen to be 0.5 or 0.6, AFSA2 can maintain the transmission efficiency well above 0.65 for the case of a typical EPC code length of 96 bits and for the investigated range of tag population, i.e., from 2 to 1000, while keeping the mean identification delay below ten transmit contentions. Very light computational burden at the reader is needed: the reader needs only to measure the collision rate in the current frame and then to double or halve the frame size accordingly. No additional computational burden is required at the tag side.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptive RFID Anti-Collision Algorithm Based on Dynamic Framed ALOHA

The collision of ID signals from a large number of colocated passive RFID tags is a serious problem; to realize a practical RFID systems we need an effective anti-collision algorithm. This letter presents an adaptive algorithm to minimize the total time slots and the number of rounds required for identifying the tags within the RFID reader’s interrogation zone. The proposed algorithm is based o...

متن کامل

Performance Comparison of Binary Search Tree and Framed ALOHA Algorithms for RFID Anti-Collision

Binary search tree and framed ALOHA algorithms are commonly adopted to solve the anti-collision problem in RFID systems. In this letter, the read efficiency of these two anti-collision algorithms is compared through computer simulations. Simulation results indicate the framed ALOHA algorithm requires less total read time than the binary search tree algorithm. The initial frame length strongly a...

متن کامل

Tag Anti-collision Algorithms in RFID Systems - a New Trend

RFID is a wireless communication technology that provides automatic identification or tracking and data collection from any tagged object. Due to the shared communication channel between the reader and the tags during the identification process in RFID systems, many tags may communicate with the reader at the same time, which causes collisions. The problem of tag collision has to be addressed t...

متن کامل

An Investigation into the Energy Efficiency of Pure and Slotted Aloha Based RFID Anti-Collision Protocols

This paper investigates the energy efficiency of RFID anti-collision protocols and their suitability for use in RFID-enhanced wireless sensor networks (WSNs). We present a detailed analytical methodology and an in-depth qualitative and quantitative energy consumption analysis of Pure and Slotted Aloha anti-collision protocols and their variants. We find that Slotted Aloha variants that employ m...

متن کامل

Scrutinizing Behavior of a Dynamic Framed Slotted Anti-collision Algorithm for RFID Systems

Radio frequency identification systems with passive tags dramatically increase the ability of an organization to acquire a vast array of data about the location and properties of any entity that can be physically tagged and wirelessly scanned within certain technical limitations. However, if multiple tags are to be identified simultaneously, messages from the tags can collide and cancel each ot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • EURASIP J. Emb. Sys.

دوره 2016  شماره 

صفحات  -

تاریخ انتشار 2016